A necessary condition for a graph to be the visibility graph of a simple polygon
نویسندگان
چکیده
منابع مشابه
A necessary condition for a Shearlet system to be a frame via admissibility
Necessary conditions for shearlet and cone-adapted shearlet systems to be frames are presented with respect to the admissibility condition of generators.
متن کاملA randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon
We present a randomized algorithm to compute a clique of maximum size in the visibility graph G of the vertices of a simple polygon P . The input of the problem consists of the visibility graph G, a Hamiltonian cycle describing the boundary of P , and a parameter δ ∈ (0, 1) controlling the probability of error of the algorithm. The algorithm does not require the coordinates of the vertices of P...
متن کاملA note on a graph related to the comaximal ideal graph of a commutative ring
The rings considered in this article are commutative with identity which admit at least two maximal ideals. This article is inspired by the work done on the comaximal ideal graph of a commutative ring. Let R be a ring. We associate an undirected graph to R denoted by mathcal{G}(R), whose vertex set is the set of all proper ideals I of R such that Inotsubseteq J(R), where J(R) is...
متن کاملA necessary and sufficient eigenvector condition for a connected graph to be bipartite
We give a necessary and sufficient condition for a graph to be bipartite in terms of an eigenvector corresponding to the largest eigenvalue of the adjacency matrix of the graph.
متن کاملThe Polynomials of a Graph
In this paper, we are presented a formula for the polynomial of a graph. Our main result is the following formula: [Sum (d{_u}(k))]=[Sum (a{_kj}{S{_G}^j}(1))], where, u is an element of V(G) and 1<=j<=k.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00208-0